import java.util.Arrays;
import java.util.Scanner;

public class Test {
    public static void main(String[] args) {
        int n = 9;
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= i; j++) {
                System.out.print(i + "*" + j + " = " + i * j + " ");
            }
            System.out.println();
        }
    }
    public static void main11(String[] args) {
        int n = -123;
        if(n < 0) {
            n = -n;
        }
        if(n == 0) {
            System.out.println("0");
            return;
        }
        while(n != 0) {
            System.out.print(n % 10);
            n /= 10;
        }
    }
    public static void main0(String[] args) {
        int count = 3;
        Scanner in = new Scanner(System.in);
        while(count > 0) {
            String password = "123456";
            String inPass = in.nextLine();
            if(password.equals(inPass)) {
                System.out.println("密码正确");
                break;
            } else {
                count--;
                System.out.println("密码错误，还有" + count +"次机会");
            }
        }
    }
    public static void print(int n, int type) {
        type %= 2;
        String[] arr = {"偶数:", "奇数:"};
        System.out.print(arr[type]);
        for(int i = 31 - type; i >= 0; i -= 2) {
            System.out.print(n >> i & 1);
        }
        System.out.println();
    }
    public static void main10(String[] args) {
        print(10, 1);
        print(10, 0);
    }
    public static String myToString(int[] arr) {
        if(arr == null) {
            return "null";
        }
        if(arr.length == 0) {
            return "[]";
        }
        String ret = "[";
        for (int i = 0; i < arr.length; i++) {
            ret += arr[i];
            if(i == arr.length - 1) {
                continue;
            }
            ret += ", ";
        }
        ret += "]";
        return ret;
    }
    public static void main9(String[] args) {
        int[] arr = {};
        System.out.println(myToString(arr));
        System.out.println(Arrays.toString(arr));
    }
    public static int[] fib2(int n) {
        int[] ret = new int[n];
        if(n == 1) {
            ret[0] = 1;
            return ret;
        }
        if(n == 2) {
            ret[1] = 1;
            return ret;
        }
        ret[0] = 1;
        ret[1] = 1;
        for (int i = 2; i < n; i++) {
            ret[i] = ret[i - 1] + ret[i - 2];
        }
        return ret;
    }
    public static void main8(String[] args) {
//        int[] arr = new int[]{1,2,3};
//        for (int x:
//        arr){
//            System.out.println(x);
//        }
        int[] arr1 = {1,23,3};
        int[] arr2 = new int[]{4,5,6,7};
        arr1 = arr2;

    }

    //求数组a中所有元素的和
    static int sum(int[] a){
        int ret = 0;
        for (int i = 0; i < 10; i++) {
            ret += a[i];
        }
        return ret;
    }

    //求数组a中下标从start开始到数组末尾的元素的和
    static int sum(int[] a, int start){
        int ret = 0;
        for (int i = start; i < 10; i++) {
            ret += a[i];
        }
        return ret;
    }

    //求数组a中下标从start开始到end-1的元素的和
    static int sum(int[] a, int start, int end){
        int ret = 0;
        for (int i = start; i < end; i++) {
            ret += a[i];
        }
        return ret;
    }
    public static int gcd ( int m, int n ) //求最大公约数
    {
        while(m % n != 0) {
            int t = m % n;
            m = n;
            n = t;
        }
        return n;
    }
    public static int lcm ( int m, int n ) //求最小公倍数
    {
        int ret = m > n ? m : n;
        while(ret % n != 0 || ret % m != 0) {
            ret++;
        }
        return ret;
    }
    public static boolean isOdd(int data) {
        return data % 2 == 0;
    }
    public static int rNum(int num) {
        int k = 0;
        while(num != 0) {
            k = num % 10 + k * 10;
            num /= 10;
        }
        return k;
    }
    public static int fac(int k) {
        if(k == 1)
            return 1;
        return k * fac(k - 1);
    }
    public static void print(int n) {
        if(n >= 10) {
            print(n / 10);
        }
        System.out.print(n % 10 + " ");
    }
    public static int sum(int n) {
        if(n < 10)
            return n;
        return n % 10 + sum(n / 10);
    }
    public static int fib(int n) {
        if(n == 1 || n == 2) {
            return 1;
        }
        return fib(n - 1) + fib(n - 2);
    }
    public static void main3(String[] args) {
//        int ret = fac(5);
//        print(1234);
//        System.out.println(sum(1729));
        System.out.println(fib(5));
    }
    public static void main2(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int t = scanner.nextInt();
        if(t == 1 || t == 2) {
            System.out.println("1");
        } else {
            int num1 = 1;
            int num2 = 1;
            int k = 0;
            while (t > 2) {
                k = num1 + num2;
                num1 = num2;
                num2 = k;
                t--;
            }
            System.out.println(k);
        }
    }
    public static int max(int a, int b) {
        return a > b ? a : b;
    }
    public static int max(int a, int b, int c) {
        return a > b ? a > c ? a : b : b > c ? b : c;
    }
    public static double max(double a, double b) {
        return a > b ? a : b;
    }
    public static void main1(String[] args) {
        Scanner scanner = new Scanner(System.in);
        System.out.println(max(1,2));
        System.out.println(max(1.1,2.7));
        System.out.println(max(11,10, 8));
    }
}
